- irreflexive preorder
- мат.нерефлексивный предпорядок
English-Russian scientific dictionary. 2008.
irreflexive preorder
Смотреть что такое "irreflexive preorder" в других словарях:
Binary relation — Relation (mathematics) redirects here. For a more general notion of relation, see Finitary relation. For a more combinatorial viewpoint, see Theory of relations. In mathematics, a binary relation on a set A is a collection of ordered pairs of… … Wikipedia
Partially ordered set — The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… … Wikipedia
Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be … Wikipedia
Reflexive relation — In mathematics, a reflexive relation is a binary relation on a set for which every element is related to itself, i.e., a relation on S where x x holds true for every x in S.[1] For example, could be is equal to . Contents 1 Related terms 2… … Wikipedia
Strict weak ordering — The 13 possible strict weak orderings on a set of three elements {a, b, c}. The only partially ordered sets are coloured, while totally ordered ones are in black. Two orderings are shown as connected by an edge if they differ by a single… … Wikipedia
Equivalence relation — In mathematics, an equivalence relation is a binary relation between two elements of a set which groups them together as being equivalent in some way. Let a , b , and c be arbitrary elements of some set X . Then a b or a ≡ b denotes that a is… … Wikipedia
Direct product — In mathematics, one can often define a direct product of objects already known, giving a new one. This is generally the Cartesian product of the underlying sets, together with a suitably defined structure on the product set. More abstractly, one… … Wikipedia
Isomorphism — In abstract algebra, an isomorphism (Greek: ἴσος isos equal , and μορφή morphe shape ) is a bijective map f such that both f and its inverse f −1 are homomorphisms, i.e., structure preserving mappings.In the more general setting of category… … Wikipedia
Total order — In set theory, a total order, linear order, simple order, or (non strict) ordering is a binary relation (here denoted by infix ≤) on some set X. The relation is transitive, antisymmetric, and total. A set paired with a total order is called a… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Inverse relation — In mathematics, the inverse relation of a binary relation is the relation that occurs when you switch the order of the elements in the relation. For example, the inverse of the relation child of is the relation parent of . In formal… … Wikipedia
